MUSIC algorithm based on eigenvalue clustering
نویسندگان
چکیده
The traditional MUSIC algorithm needs to know the number of target signal sources in advance, and further determine dimensions subspace noise subspace, finally search for spectral peaks. In engineering, it is impossible predict be measured. To solve above-mentioned problem, an improved without estimating proposed. present algorithm, all eigenvectors covariance matrix are regarded as estimation, but existence will make result unreliable. order estimation more accurate, a new weighting method results simulation show that can accurately estimate direction when unknown, has greater practicability than algorithm. addition, better robustness.
منابع مشابه
ON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY
The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...
متن کاملClassical Music Clustering Based on Acoustic Features
In this paper we cluster 330 classical music pieces collected from MusicNet database based on their musical note sequence. We use shingling and chord trajectory matrices to create signature for each music piece and performed spectral clustering to find the clusters. Based on different resolution, the output clusters distinctively indicate composition from different classical music era and diffe...
متن کاملA Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach
In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملClustering based on genetics algorithm
Genetic Algorithms (GAs) have been fairly successful at solving problems of this type that are too ill-behaved (such as multi modal and/or non-differentiable) for more conventional hill-climbing and derivative based techniques. They are not guaranteed to find the global optimum solution to a problem, but they are generally good at finding acceptably good solutions to problems acceptably quickly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Xibei gongye daxue xuebao
سال: 2023
ISSN: ['1000-2758', '2609-7125']
DOI: https://doi.org/10.1051/jnwpu/20234130574